A meta-interpreter based on paraconsistent legal knowledge engineering

The Legal Knowledge Engineering is a new topic of investigation of Artificial Intelligence. This paper discusses some relevant problems related to this new area in a summarized way. Within the Normative Law Theory, one question that arises naturally is that of contradiction, like for example: articles conflicting with other articles inside the same code, codes conflicting with codes, codes conflicting with jurisprudence, and in general, treatments with conflicting propositions in Normative Law Theory. This paper suggests to treat directly inconsistencies in the Legal Knowledge Engineering; this engineering has as underlying logic a paraconsistent annotated deontic logic. There are three main approximations in Legal Knowledge Engineering based on: cases, rules and logic. In this paper, we consider the approximation based on logic. It is considered a paraconsistent annotated deontic logic. Based on this logic, it is established a new proposal that is called Paraconsistent Legal Knowledge Engineering. For this proposal, it it is suggested a meta-interpreter to support the deontic operators as well as inconsistency — entitled on this paper Paralog D that can be used as a base to handle with the issues discussed

Some results on Jaśkowski’s discursive logic

Jaśkowski [3] presented a new propositional calculus labeled “discussive propositional calculus”, to serve as an underlying basis for inconsistent but non-trivial theories. This system was later extended to lower and higher order predicate calculus ([1], [2]). Jaśkowski’s system of discussive or discursive propositional calculus can actually be extended to predicate calculus in at least two ways. We have the intention using this calculus of building later as a basis for a discussive theory of sets. One way is that studied by Da Costa and Dubikajtis. Another one is developed in this paper as a solution to a problem formulated by Da Costa. In this work we study a first order discussive predicate calculus J∗∗ .The paper consists of three parts. In the first part we introduce the calculus J∗∗ and, following Prof. D. Makinson’s suggestion, we show that it is not identical with the predicate calculus [2] of Da Costa and Dubikajtis. An axiomatization of J∗∗ is presented. In the second one, we introduce new discussive connectives and study some of the properties. We observe that the usual Kripke semantics can be adapted to the calculus J∗∗

Analysis of the displacement of terrestrial mobile robots in corridors using paraconsistent annotated evidential logic e{\tau}

This article proposes an algorithm for a servo motor that controls the movement of an autonomous terrestrial mobile robot using Paraconsistent Logic. The design process of mechatronic systems guided the robot construction phases. The project intends to monitor the robot through its sensors that send positioning signals to the microcontroller. The signals are adjusted by an embedded technology interface maintained in the concepts of Paraconsistent Annotated Logic acting directly on the servo steering motor. The electric signals sent to the servo motor were analyzed, and it indicates that the algorithm paraconsistent can contribute to the increase of precision of movements of servo motors

not available

não disponívelnot availabl

On the foundations of annotated logics

As logicas anotadas sao uma classe de logicas nao-classicas introduzidas por v.S. Subrahmanian (subrahmanian, v.S.), On the semantics of quantitative logic programs, proc. 4th ieee symposium on logic programming, computer society press, washington dc, 1987, 173-182. Devido a significantes aplicacoes obtidas na teoria da computacao e na inteligencia artificial, tornou-se conveniente um estudo detalhado de seus fundamentos. Um primeiro trabalho nesse sentido e da costa, nca, vs subrahmanian & cva ca, (the paraconsistent logics pi, zeitschrift fur math logik und grund der math 37, 1991, 137-148). Nesta tese damos seguimento ao estudo dos fundamentos da logica anotada qi, investigamos sua semantica e demonstramos um teorema de completude. Pesquisamos a teoria anotada de modelos e mostramos que versoes da maioria dos resultados basicos da teoria classica de modelos sao validas para os sistemas qi. Os sistemas anotados englobam a teoria dos conjuntos difusos (fuzzy sets), o que nos conduz a uma outra aplicacao fundamental destas logicas; os resultados relevantes foram publicados em da costa nca, j abel & vs subrahmanian, remarks on annotated logics\', a aparecer em zeitsghrift fur math. Logik und grund der math. 1991, vol. 37Annotated logics are a class of non-classical logics introduced by V. S. Subrahmanian CSUBRAHMANIAN. V. S . On the Semantics o/ Quantitatiue Losic Prosram.s, Proc. 4.th IEEE Symposium on Logic Programming, Washington DC, 1987. 173-182). applications obtained in Computer Computer Science Press, Due Science to and significant Artificial Intelligence, it is convenient to study in detail their foundations. A first work in this sense is DA COSTA, N.C.A., V.S. SUBRAHMANIAN & C. VAGO, The paraconsistent logics PT\', Zei tschrif t /ür Hath. Losi.1\'. und Grund. der Hath. 37, 1991, 137-138. This thesis is a seque! to the study of the foundations of annotated logics Qr; we investigate their semantics and prove a çompleteness theorem. studying the annotated model theory and showing that practically all the main basic results in classical model theory can be reproduced in these systems. The annotated systems encompass the theory of fuzzy sets, conducting us to another fundamental application of these logics·; the relevant results were published in DA COSTA, N. C. A., J. M. ASE & V. S. SUBRAHMANIAN, Remarks on annotated logic\', to appear in Zeitschrift fü.r Hath. LoeiJtt und Grund. der Hath. , 1991, vol . 3

A noção de estrutura em matemática e física

Submitted by Guilherme Lemeszenski ([email protected]) on 2013-08-22T18:58:44Z No. of bitstreams: 1 S0103-40141989000200007.pdf: 2757191 bytes, checksum: c3856bf78d938a91fdf8d36a7a9f26a1 (MD5)Made available in DSpace on 2013-08-22T18:58:44Z (GMT). No. of bitstreams: 1 S0103-40141989000200007.pdf: 2757191 bytes, checksum: c3856bf78d938a91fdf8d36a7a9f26a1 (MD5) Previous issue date: 1989-08-01Made available in DSpace on 2013-09-30T19:54:44Z (GMT). No. of bitstreams: 2 S0103-40141989000200007.pdf: 2757191 bytes, checksum: c3856bf78d938a91fdf8d36a7a9f26a1 (MD5) S0103-40141989000200007.pdf.txt: 28128 bytes, checksum: 3e629a12aa6edebf2631baecd560a2c6 (MD5) Previous issue date: 1989-08-01Submitted by Vitor Silverio Rodrigues ([email protected]) on 2014-05-20T15:14:14Z No. of bitstreams: 2 S0103-40141989000200007.pdf: 2757191 bytes, checksum: c3856bf78d938a91fdf8d36a7a9f26a1 (MD5) S0103-40141989000200007.pdf.txt: 28128 bytes, checksum: 3e629a12aa6edebf2631baecd560a2c6 (MD5)Made available in DSpace on 2014-05-20T15:14:14Z (GMT). No. of bitstreams: 2 S0103-40141989000200007.pdf: 2757191 bytes, checksum: c3856bf78d938a91fdf8d36a7a9f26a1 (MD5) S0103-40141989000200007.pdf.txt: 28128 bytes, checksum: 3e629a12aa6edebf2631baecd560a2c6 (MD5) Previous issue date: 1989-08-01Universidade Estadual Paulista Departamento de CiênciasUniversidade de São Paulo Instituto de Estudos Avançados Grupo de Lógica e Filosofia da CiênciaUniversidade Estadual Paulista Departamento de Ciência